Packing problems - PDFSEARCH.IO - Document Search Engine

Packing problems
Results: 74

#	Item
61	1 Distributed Optimization in Wireless Networks Using Broadcast Advantage Tao Cui, Lijun Chen, and Tracey Ho Member, IEEE Division of Engineering and Applied Science Add to Reading List Source URL: authors.library.caltech.edu Language: English - Date: 2012-12-26 09:14:24 NP-complete problems Combinatorics Coding theory Hypergraph 3-dimensional matching Matching Network coding Randomized algorithm Set packing Theoretical computer science Mathematics Computational complexity theory
62	Packing a Knapsack of Unknown Capacity Yann Disser∗ , Max Klimm, Nicole Megow† , and Sebastian Stiller Department of Mathematics, Technische Universität Berlin, Germany {disser,klimm,nmegow,stiller}@math.tu-berlin.d Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2014-06-06 08:08:21 Combinatorial optimization NP-complete problems Permutations Cryptography Knapsack problem Operations research Merkle–Hellman knapsack cryptosystem Fisher–Yates shuffle Universal property Theoretical computer science Mathematics Computational complexity theory
63	Abstract flows over time: A first step towards solving dynamic packing problems? Jan-Philipp W. Kappmeier, Jannik Matuschke, and Britta Peis TU Berlin, Institut f¨ ur Mathematik, Straße des 17. Juni 136, 10623 Berlin, Add to Reading List Source URL: www.redaktion.tu-berlin.de Language: English - Date: 2012-11-12 07:12:44 Combinatorics Maximum flow problem Flow network Dimensional analysis Fluid dynamics Cut Max-flow min-cut theorem Ford–Fulkerson algorithm Network flow Graph theory Mathematics
64	A Tree Search Algorithm for Solving the Container Loading Problem Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2011-11-29 06:50:37 Discrete geometry NP-complete problems Packaging Packing problem BL1 Box Knapsack problem Bin packing problem Cuboid Mathematics Theoretical computer science Geometry
65	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Complexity classes NP-complete problems Mathematical optimization Bin packing problem Operations research Polynomial-time approximation scheme Strongly NP-complete Job shop scheduling Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
66	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Operations research Mathematical optimization Bin packing problem Polynomial-time approximation scheme Job shop scheduling Knapsack problem Strongly NP-complete Theoretical computer science Computational complexity theory Applied mathematics
67	School of Computer Science Automated Scheduling, Optimisation and Planning (ASAP) Research Group Research Report[removed] Add to Reading List Source URL: www.asap.cs.nott.ac.uk Language: English - Date: 2012-04-25 03:59:08 Mathematics Theoretical computer science Mathematical optimization Hyper-heuristic NP-complete problems Graham Kendall Travelling salesman problem Bin packing problem Scheduling Operations research Heuristics Applied mathematics
68	School of Computer Science and IT Automated Scheduling, Optimisation and Planning (ASAP) Research Group Research Report 2005 – 2006 Add to Reading List Source URL: www.asap.cs.nott.ac.uk Language: English - Date: 2012-05-02 05:07:31 Mathematical optimization Heuristics Theoretical computer science Planning Hyper-heuristic NP-complete problems Genetic algorithm Bin packing problem Heuristic function Operations research Applied mathematics Mathematics
69	CS 598CSC: Approximation Algorithms Instructor: Chandra Chekuri Add to Reading List Source URL: courses.engr.illinois.edu Language: English - Date: 2009-02-06 16:43:24 Operations research NP-complete problems Combinatorial optimization Dynamic programming Knapsack problem Bin packing problem Polynomial-time approximation scheme Approximation algorithm Linear programming relaxation Theoretical computer science Computational complexity theory Applied mathematics
70	Microsoft Word - lecture note-2.doc Add to Reading List Source URL: www.ieor.berkeley.edu Language: English - Date: 2005-02-21 15:26:09 Spanning tree NP-complete problems Eulerian path Matching Degree Connectivity Minimum spanning tree Bin packing problem Graph coloring Theoretical computer science Mathematics Graph theory